Permutation graphs and the weak Bruhat order

Permutation graphs are associated with permutations where edges represent inversions. We study different classes of permutation and  isomorphic graphs. A complete answer a basic isomorphism question is given for trees. connection to the majorization order integer partitions established, in notion inversion vectors. Finally, we special transitivity properties related inversions permutations.